Least adaptive optimal search with unreliable tests
نویسندگان
چکیده
منابع مشابه
Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests
We consider the problem of determining the minimum number of queries to find an unknown number in a finite set when up to a finite number e of the answers may be erroneous. In the vast literature regarding this problem, mostly the classical case of binary search is considered, i.e., when only yes–no questions are allowed. In this paper we consider a generalization of the problem which arises wh...
متن کاملDistributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...
متن کاملGroup Testing with Unreliable Tests
We consider the problem of locating two unknown elements x; y using group testing devices. Assuming that up to a given number E of tests out of Q can give erroneous feedback, we provide optimal algorithms to search for x and y.
متن کاملOptimal search trees with equality tests
We study the following problem: given a set of keys and access probabilities, find a minimum-cost binary search tree that uses only 2-way comparisons (=, <,≤) at each node. We give the first polynomialtime algorithm when both successful and unsuccessful queries are allowed, settling a long-standing open question. Our algorithm relies on a new structural theorem that proves a conjecture of Spule...
متن کاملOptimal and near-optimal algorithms for multiple fault diagnosis with unreliable tests
In this paper, we consider the problem of constructing optimal and near-optimal multiple fault diagnosis (MFD) in bipartite systems with unreliable (imperfect) tests. It is known that exact computation of conditional probabilities for MFD is NP-hard. The novel feature of our diagnostic algorithms is the use of Lagrangian relaxation and subgradient optimization methods to provide 1) near-optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00116-5